The Arnoldi Process and GMRES for Nearly Symmetric Matrices
نویسندگان
چکیده
Matrices with a skew-symmetric part of low rank arise in many applications, including path following methods and integral equations. This paper explores the properties of the Arnoldi process when applied to such a matrix. We show that an orthogonal Krylov subspace basis can be generated with short recursion formulas and that the Hessenberg matrix generated by the Arnoldi process has a structure, which makes it possible to derive a progressive GMRES method. Eigenvalue computation is also considered.
منابع مشابه
GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
The GMRES and Arnoldi algorithms, which reduce to the CR and Lanczos algorithms in the symmetric case, both minimize p(A)b over polynomials p of degree n. The difference is that p is normalized at z 0 for GMRES and at z x for Arnoldi. Analogous "ideal GMRES" and "ideal Arnoldi" problems are obtained if one removes b from the discussion and minimizes p(/l)II instead. Investigation of these true ...
متن کاملHow Descriptive Are Gmres Convergence Bounds?
Eigenvalues with the eigenvector condition number, the eld of values, and pseu-dospectra have all been suggested as the basis for convergence bounds for minimum residual Krylov subspace methods applied to non-normal coeecient matrices. This paper analyzes and compares these bounds, illustrating with six examples the success and failure of each one. Reened bounds based on eigenvalues and the eld...
متن کاملInvestigating the Effects of MINRES with Local Reorthogonalization
The minimum residual method, MINRES, is an iterative method for solving a n x n linear system, Ax = b, where is A is a symmetric matrix. It searches for a vector, xk, in the k th Krylov subspace that minimizes the residual, rk = b − Axk. Due to the symmetric nature, the vectors are computed to be the Lanczos vectors, which simplifies to a three-term recurrence, where vk+1 is computed as a linea...
متن کاملA QR-decomposition of block tridiagonal matrices generated by the block Lanczos process
For MinRes and SymmLQ it is essential to compute a QR decomposition of a tridiagonal coefficient matrix gained in the Lanczos process. This QR decomposition is constructed by an update scheme applying in every step a single Givens rotation. Using complex Householder reflections we generalize this idea to block tridiagonal matrices that occur in generalizations of MinRes and SymmLQ to block meth...
متن کاملAnalysis of Some Vector Extrapolation Methods for Solving Systems of Linear Equations
In this paper, we consider some vector extrapolation methods for solving nonsymmetric systems of linear equations. When applied to sequences generated linearly, these methods namely the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE), are Krylov subspaces methods and are respectively equivalent to the method of Arnoldi and to the GCR and GMRES. By considering the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 30 شماره
صفحات -
تاریخ انتشار 2008